1

A Mixture of Dynamic Programming and Branch-and-Bound for the Subset-Sum Problem

Silvano Martello and Paolo Toth
Journal:
Management Science
Year:
1984
Language:
english
File:
PDF, 212 KB
english, 1984
2

A New Algorithm for the 0-1 Knapsack Problem

Silvano Martello and Paolo Toth
Journal:
Management Science
Year:
1988
Language:
english
File:
PDF, 1.36 MB
english, 1988
3

Upper Bounds and Algorithms for Hard 0-1 Knapsack Problems

Silvano Martello and Paolo Toth
Journal:
Operations Research
Year:
1997
Language:
english
File:
PDF, 400 KB
english, 1997
5

The Fixed Job Schedule Problem with Spread-Time Constraints

Matteo Fischetti, Silvano Martello and Paolo Toth
Journal:
Operations Research
Year:
1987
Language:
english
File:
PDF, 351 KB
english, 1987
6

A Note on the Ingargiola-Korsh Algorithm for One-Dimensional Knapsack Problems

Silvano Martello and Paolo Toth
Journal:
Operations Research
Year:
1980
Language:
english
File:
PDF, 244 KB
english, 1980
7

An Exact Algorithm for the Two-Constraint 0-1 Knapsack Problem

Silvano Martello and Paolo Toth
Journal:
Operations Research
Year:
2003
Language:
english
File:
PDF, 509 KB
english, 2003
8

The Fixed Job Schedule Problem with Working-Time Constraints

Matteo Fischetti, Silvano Martello and Paolo Toth
Journal:
Operations Research
Year:
1989
Language:
english
File:
PDF, 514 KB
english, 1989
9

An Algorithm for the Bottleneck Traveling Salesman Problem

Giorgio Carpaneto, Silvano Martello and Paolo Toth
Journal:
Operations Research
Year:
1984
Language:
english
File:
PDF, 319 KB
english, 1984